Coin-based Secure Computations

نویسندگان

چکیده

Abstract In the history of cryptography, many cryptographic protocols have relied on random coin tosses to prove their security. Although flipping coins is indispensable in this manner, themselves never been spotlight. Therefore, we would like make physical rise level just as a deck playing cards has used perform secure multi-party computation. Such card-based protocol known be helpful both computation without any black-box computers and understand principles protocols. paper, propose new framework using coins, named coin-based . One advantage use that they are more ubiquitous than cards. Whereas face-down card can conceal information about its face side, one side reveals other side. Hence, careful design required for one. We formalize computational model explicitly give NOT, AND, COPY, OR, XOR computations. also discuss composability extended how implement them practice.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptively Secure Coin-Flipping, Revisited

The full-information model was introduced by Ben-Or and Linial in 1985 to study collective coin-flipping: the problem of generating a common bounded-bias bit in a network of n players with t = t(n) faults. They showed that the majority protocol, in which each player sends a random bit and the output is the majority of the players’ bits, can tolerate t(n) = O( √ n) even in the presence of adapti...

متن کامل

Secure Multi-Agent Computations

We propose a security model for open multi-agent systems. Given a user-defined task T , we generate a group of mobile agents which realise a common functionality that solves T . Those agents cooperate with each other and build an autonomous community. Using a scheme for secure distributed computations, this community is able to perform secure computations without requiring interaction with a tr...

متن کامل

Quantum-Secure Coin-Flipping and Applications

In this paper, we prove classical coin-flipping secure in the presence of quantum adversaries. The proof uses a recent result of Watrous [20] that allows quantum rewinding for protocols of a certain form. We then discuss two applications. First, the combination of coin-flipping with any non-interactive zero-knowledge protocol leads to an easy transformation from non-interactive zero-knowledge t...

متن کامل

Secure Deduplication of General Computations

The world’s fast-growing data has become highly concentrated on enterprise or cloud storage servers. Data deduplication reduces redundancy in this data, saving storage and simplifying management. While existing systems can deduplicate computations on this data by memoizing and reusing computation results, they are insecure, not general, or slow. This paper presents UNIC, a system that securely ...

متن کامل

Secure Outsourcing of Some Computations

The rapid growth of the Internet facilitates the outsourcing of certain computations, in the following sense: A customer who needs these computations done on some data but lacks the computational resources (or programming expertise) to do so, can use an external agent to perform these computations. This currently arises in many practical situations, including the nancial services and petroleum ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Information Security

سال: 2022

ISSN: ['1615-5262', '1615-5270']

DOI: https://doi.org/10.1007/s10207-022-00585-8